The Elementary Path Problem: A DP Solution
ثبت نشده
چکیده
can be computed as 1274 + 874 + 779 + 885 = 3812. Since the number of possible paths in this particular network is equal to 18 (= 2 × 3 × 3), the total computational effort of a complete enumeration is not unacceptable. However, as the number of cities in the network increases, the number of possible paths will grow very rapidly, making a complete enumeration prohibitively time consuming. It is therefore desirable to seek more efficient ways to determine the solution to our problem. Below, we will describe a dynamic programming solution.
منابع مشابه
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
In this paper, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution procedures based on column generation for several important problems, such as vehicle routing and crew-pairing. In many cases relaxing the restr...
متن کاملNumerical solution of higher index DAEs using their IAE's structure: Trajectory-prescribed path control problem and simple pendulum
In this paper, we solve higher index differential algebraic equations (DAEs) by transforming them into integral algebraic equations (IAEs). We apply collocation methods on continuous piece-wise polynomials space to solve the obtained higher index IAEs. The efficiency of the given method is improved by using a recursive formula for computing the integral part. Finally, we apply the obtained algo...
متن کاملThe Multiple Choice Elementary Constrained Shortest Path Problem
This paper considers a variation of the Elementary Constrained Shortest Path Problem in which nodes are separated into subsets and a feasible path through the network may visit at most one node from each subset. We refer to this problem as the Multiple Choice Elementary Constrained Shortest Path Problem (MC-ECSPP). The MC-ECSPP arises as a subproblem in branch-and-price approaches for variation...
متن کاملThe Isoperimetric Problem Revisited: Extracting a Short Proof of Sufficiency from Euler’s 1744 Approach to Necessity∗
Our primary objective in this paper is, with the student in mind, to present a short, elementary, and teachable solution of the isoperimetric problem. A secondary objective is to give a brief, but reasonably complete, overview of the remarkable life of the isoperimetric problem. In 1744 Euler constructed multiplier theory to solve the isoperimetric problem. However, contrary to Euler’s belief, ...
متن کاملAsymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
With their paper ”Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000